Quadratic programming for class ordering in rule induction
نویسندگان
چکیده
منابع مشابه
Quadratic programming for class ordering in rule induction
Separate-and-conquer type rule inductionalgorithms suchasRipper, solve aK>2classproblembyconverting it into a sequence of K − 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing prior probabilities. Although the heuristic works well in practice, there is much room for improvement. In this paper, we propose a novel approach to improve thi...
متن کاملGenetic Programming for Design Grammar Rule Induction
The knowledge engineering effort associated with defining grammar systems can become a barrier for the practical use of such systems. Existing grammar and rule induction algorithms offer rather limited support for discovering context-sensitive graph grammar rules as required by some applications in the domain of engineering design. For this task the present work proposes a rule induction method...
متن کاملEdmonds Fukuda Rule and a General Recursion for Quadratic Programming
AND A GENERAL RECURSION FOR QUADRATIC PROGRAMMING Komei Fukuda Tam as Terlaky Dept.of Inf.S i. Dept. of O.R. Tokyo Inst.of Te h. E otv os University 2-12-1 Oh-Okayama 1088.Budapest Meguro-ku, Tokyo 152. Muzeum krt.6-8. JAPAN HUNGARY Abbreviated title: A nite algorithmi framework and E-F rule for QP.
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2015
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2014.12.002